Best Approximation of Ruspini Partitions in Gödel Logic

نویسندگان

  • Pietro Codara
  • Ottavio M. D'Antona
  • Vincenzo Marra
چکیده

A Ruspini partition is a finite family of fuzzy sets {f1, . . . , fn}, fi : [0, 1] → [0, 1], such that ∑ n i=1 fi(x) = 1 for all x ∈ [0, 1]. We analyze such partitions in the language of Gödel logic. Our main result identifies the precise degree to which the Ruspini condition is expressible in this language, and yields inter alia a constructive procedure to axiomatize a given Ruspini partition by a theory in Gödel logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Analysis of Ruspini Partitions in Gödel Logic

By a Ruspini partition we mean a finite family of fuzzy sets {f1, . . . , fn}, fi : [0, 1] → [0, 1], such that ∑n i=1 fi(x) = 1 for all x ∈ [0, 1], where [0, 1] denotes the real unit interval. We analyze such partitions in the language of Gödel logic. Our first main result identifies the precise degree to which the Ruspini condition is expressible in this language, and yields inter alia a const...

متن کامل

The logical content of triangular bases of fuzzy sets in Lukasiewicz infinite-valued logic

Continuing to pursue a research direction that we already explored in connection with Gödel-Dummett logic and Ruspini partitions, we show here that Lukasiewicz logic is able to express the notion of pseudo-triangular basis of fuzzy sets, a mild weakening of the standard notion of triangular basis. En route to our main result we obtain an elementary, logic-independent characterisation of triangu...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Open Partitions and Probability Assignments in Gödel Logic

In the elementary case of finitely many events, we generalise to Gödel (propositional infinite-valued) logic — one of the fundamental fuzzy logics in the sense of Hájek — the classical correspondence between partitions, quotient measure spaces, and push-forward measures. To achieve this end, appropriate Gödelian analogues of the Boolean notions of probability assignment and partition are needed...

متن کامل

Special issue on the Tenth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2009)

This special issue of the International Journal of Approximate Reasoning is devoted to some of the best papers presented at the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’07) which took place in Hammamet, Tunisia from October 31 to November 2, 2007. For this edition, we have selected a collection of 11 papers (from 75 accepted in ECS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007